Finding Core Allocations for Fixed Cost Games in Electricity Networks

نویسندگان

  • Endre Bjørndal
  • Georgios C. Stamtsis
  • István Erlich
چکیده

We discuss the cost allocation problem faced by a network operator, where the fixed (residual) cost of the network has to be allocated among its users. Usage-based methods, such as the postage stamp rate method and the MW-mile method, are easy to understand and compute, but may yield cost allocations for which some transactions are subsidizing others. Formally, this is equivalent to allocations outside of the core of the corresponding cooperative cost game. Our main contribution is to present a method, similar to a well-known method for computing the nucleolus, by which several usage-based methods may be combined in order to produce allocations that are in, or as close as possible to, the core. The method is illustrated using a model of an AC power network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on Steiner tree games

We investigate the cost allocation strategy associated with the problem of providing some service of common interest from some source to a number of network users, via the minimum cost directed Steiner tree (ST) network that spans the source and all the receivers. The cost of such ST is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. ...

متن کامل

Path coalitional games

We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional game...

متن کامل

Computing Good Allocations for Combinatorial Optimization Games

Much of the literature on cooperative games associated with combinatorial optimization problems is concerned with only one question: whether or not the core is empty. In this paper however we are concerned with the related question of finding a cost allocation whose value is as large as possible. It is well known that this amounts to solving an LP with exponentially many constraints, whose spec...

متن کامل

A reconsideration of the Kar solution for minimum cost spanning tree problems

Minimum cost spanning tree (mcst) problems try to connect agents effi ciently to a source when agents are located at different points in space and the cost of using an edge is fixed. The application of the Shapley value to the stand-alone cost game, known in this context as the Kar solution, has been criticized for sometimes proposing allocations that are outside of the core. I show that the si...

متن کامل

Stratified Median Ranked Set Sampling: Optimum and Proportional Allocations

In this paper, for the Stratified Median Ranked Set Sampling (SMRSS), proposed by Ibrahim et al. (2010), we examine the proportional and optimum sample allocations that are two well-known methods for sample allocation in stratified sampling. We show that the variances of the mean estimators of a symmetric population in SMRSS using optimum and proportional allocations to strata are smaller than ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003